Zeon and Idem-Clifford Formulations of Hypergraph Problems

Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast an ordinary graph, which each edge connects exactly two vertices, (or, “hyperedge”) can join any number of vertices a hypergraph. Hypergraphs been used problems biology, chemistry, image processing, wireless networks, more. the current work, zeon (“nil-Clifford”) “idem-Clifford” graph-theoretic methods are generalized hypergraphs. particular, idem-Clifford enumerate sets, matchings An approach finding minimum hypergraph transversals is developed, formulations some open presented.